public class Text {
    public static void main(String[] args) {

    }
    /*    public ListNode partition(ListNode pHead, int x) {
        if(pHead == null){
            return null;
        }
        ListNode bb = null;
        ListNode be = null;
        ListNode ab = null;
        ListNode ae = null;
        ListNode cur = pHead;
        while(cur != null){
            if(cur.val < x){
                if(bb==null){
                    bb = cur;
                    be = cur;
                }else{
                    be.next = cur;
                    be=be.next;
                }
            }else{
                if(ab == null){
                    ab = cur;
                    ae = cur;
                }else{
                    ae.next = cur;
                    ae=ae.next;
                }
            }
            cur = cur.next;
        }
        if(bb == null){
            return ab;
        }
        be.next = ab;
        if(ab != null){
            ae.next=null;
        }
        return bb;
    }*/
    /*public boolean chkPalindrome(ListNode A) {
        if(A == null){
            return false;
        }
        if(A.next == null){
            return true;
        }
        ListNode fast = A;
        ListNode slow = A;
        while(fast != null && fast.next != null){
            fast = fast.next.next;
            slow = slow.next;
        }
        ListNode cur = slow.next;
        while(cur != null){
            ListNode curnext = cur.next;
            cur.next = slow;
            slow = cur;
            cur = curnext;
        }
        while(A != slow){
            if(A.val == slow.val){
                A=A.next;
                slow= slow.next;
            }else{
                return false;
            }
            if(A.next == slow){
                return true;
            }
        }
        return true;
    }*/
    /*public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
        if(list1 == null){
            return list2;
        }
        if(list2 == null){
            return list1;
        }
        if(list1 == null && list2 == null){
            return null;
        }
        ListNode head = new ListNode();
        ListNode cur = head;
        while(list1 != null && list2 != null){
            if(list1.val < list2.val){
                cur.next = list1;
                cur = cur.next;
                list1 = list1.next;
            }else{
                cur.next = list2;
                cur = cur.next;
                list2 = list2.next;
            }
        }
        if(list1 != null){
            cur.next = list1;
        }
        if(list2 != null){
            cur.next = list2;
        }
        return head.next;
    }*/
    /*public static ListNode FindKthToTail(ListNode head,int k) {
        if(head == null){
            return null;
        }
        ListNode fast = head;
        ListNode slow = head;
        while(k != 0){
            k--;
            if(fast == null){
                return null;
            }
            fast = fast.next;
        }
        while(fast != null){
            fast = fast.next;
            slow = slow.next;
        }

        return slow;
    }*/
}
